computationally indistinguishable造句

A questionable encryption scheme has the property that real public keys are computationally indistinguishable from fake public keys when the private key is not available.
In cryptography, the "'hybrid argument "'is a proof technique used to show that two distributions are computationally indistinguishable.
This fact gives rise to the hybrid argument : it suffices to find such a sequence of hybrid distributions and show each pair of them is computationally indistinguishable.
Computational zero-knowledge is obtained by requiring that the views of the verifier \ hat V and the simulator are only computationally indistinguishable, given the auxiliary string.
Some pseudorandom generators are, in fact, also extractors . ( When a PRG is based on the existence of hard-core predicates, one can think of the weakly random source as a set of truth tables of such predicates and prove that the output is statistically close to uniform . ) However, the general PRG definition does not specify that a weakly random source must be used, and while in the case of an extractor, the output should be statistically close to uniform, in a PRG it is only required to be computationally indistinguishable from uniform, a somewhat weaker concept.
It's difficult to find computationally indistinguishable in a sentence. 用computationally indistinguishable造句挺难的